Textual and Visual for Content-based Image Re- 5.2 Data Preparation 5.3 Query Processing 5.3.2 Subquery Processing 4.1 Webssql Syntax Query := Select Targetattr from Tablelist Where Conditions] With-size Size]
نویسندگان
چکیده
of quadruplets (Webpages.url, Webpages..le id, Images .image id, Images.description) will be obtained. For each quadruplet, a triplet (Webpages.url, Web-pages..le id, Images.image id) are extracted and the set of triplets is used by the next step for assembling the nal result. The fourth component of each quadruplet (i.e., Images.description) will be extracted and be used by subquery q3. Subquery q2 is a query against a collection of web pages. This is exactly the kind of query seen in most search engines and in traditional document retrieval systems 24]. The standard approach for evaluating such a query is to use the inverted le index for the document collection 24, 28]. The result of evaluating q2 is a set of pairs (Web-pages..le id, similarity), where similarity > 0 is the similarity of the web page identiied by the le id with the query (the description following \text similar to"). This set of pairs will be used by the next step for assembling the nal result. Subquery q3 is processed after subquery q1 has been processed. A beneet of this evaluation order is that only image descriptions whose corresponding image ids are returned by q1 need to be used to process q3. Note that there is no inverted le index for the descriptions of images. As a result, the similarities between the image descriptions returned by q1 and the image description in the query have to be computed one by one. The evaluation of q3 produces a set of pairs (Images.image id, similarity), where similarity > 0 is the similarity of the description of the image identiied by the image id with the image description in the user query. Again, this set of pairs will be used by the next step for assembling the nal result. As described above, the result of evaluating q1 is a set of triplets (Webpages.url, Webpages..le id, Images .image id), the result of evaluating q2 is a set of pairs (Webpages..le id, similarity), and the result of evaluating q3 is a set of pairs (Images.image id, similarity). We now discuss how to generate the nal result to the user query from these triplets and pairs. The result assembling is accomplished by the following algorithm. 1. Sort the triplet le based on the url eld. Sort the two pair les based on the le id and the image id elds, respectively. 2. For each triplet, say (url 1 , w …
منابع مشابه
Tags Re-ranking Using Multi-level Features in Automatic Image Annotation
Automatic image annotation is a process in which computer systems automatically assign the textual tags related with visual content to a query image. In most cases, inappropriate tags generated by the users as well as the images without any tags among the challenges available in this field have a negative effect on the query's result. In this paper, a new method is presented for automatic image...
متن کاملDistributed Content based Image Retrieval using Navigation Pattern with Relevance Feedback
The image retrieval applications are designed to fetch required images from the image databases. Images are searched using textual query or images. The textual query based retrieval is performed with image annotations. The image features are used in the content based image retrieval process on the image database provides huge collection of images. Query image features are compared with the data...
متن کاملImage Retrieval Process from Online Server with Markov-Chain Query Processing
Here we are implanted a way of image based search method to get the information from server. Here searching process has done on automatic annotation image retrieval method and it have some keywords for each and every image independently, user can send his search request to the server in Markov method it will retrieve the data from the server based on its characteristics and its textual informat...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملانتخاب مناسبترین زبان پرسوجو برای استفاده از فراپیوندها جهت استخراج دادهها در حالت دیتالوگ در سامانه پایگاه داده استنتاجی DES
Deductive Database systems are designed based on a logical data model. Data (as opposed to Relational Databases Management System (RDBMS) in which data stored in tables) are saved as facts in a Deductive Database system. Datalog Educational System (DES) is a Deductive Database system that Datalog mode is the default mode in this system. It can extract data to use outer joins with three query la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000